Dynamic Programming and Optimal Control THIRD EDITION Dimitri P. Bertsekas Massachusetts Institute of Technology Selected Theoretical Problem Solutions

Source URL: athenasc.com

Object detection and tracking for autonomous navigation in dynamic environments Andreas Ess · Konrad Schindler · Bastian Leibe · Luc Van Gool Abstract We address the problem of vision-based navigation in busy inner-ci

Source URL: europa.informatik.uni-freiburg.de

III. DYNAMIC OPTIMIZATION PROBLEM

Source URL: web.eecs.umich.edu

Approximating Border Length for DNA Microarray Synthesis Cindy Y. Li1 Prudence W.H. Wong1 Qin Xin2 Fencol C.C. Yung3 1 3

Source URL: cgi.csc.liv.ac.uk

• Computational complexity theory
• Mathematics
• Dynamic programming
• Theory of computation
• IP
• Longest common subsequence problem

155 Documenta Math. On the History of the Shortest Path Problem Alexander Schrijver

Source URL: www.math.uiuc.edu

• Mathematics
• Graph theory
• Discrete mathematics
• Edsger W. Dijkstra
• Routing algorithms
• Operations research
• Network theory
• Shortest path problem
• Dynamic programming
• Distance
• Path
• Linear programming

LNCSEfficient Dynamic Aggregation

Source URL: webee.technion.ac.il

• Graph theory
• Mathematics
• Computational complexity theory
• Edsger W. Dijkstra
• Network theory
• Shortest path problem
• Minimum spanning tree
• Network flow
• Dynamic programming

Fast Hierarchical Clustering and Other Applications of Dynamic Closest Pairs David Eppstein∗ Abstract dynamic closest pair problem. It can be solved by brute force 2 We develop data structures for dynamic closest pair

Source URL: bioinfo.ict.ac.cn

• Mathematics
• Statistics
• Applied mathematics
• Data mining
• Search algorithms
• Approximation algorithms
• Discrete geometry
• Nearest neighbor search
• Numerical analysis
• Hierarchical clustering
• Cluster analysis
• K-means clustering

Mining Data that Changes 17 July 2015 Data is Not Static •

Source URL: people.mmci.uni-saarland.de

• Machine learning
• Data mining
• Mathematics
• Algorithms
• Streaming algorithm
• Dynamic problem
• Matrix
• Concept drift
• Learning
• Multivariate statistics
• Non-negative matrix factorization
• Applied mathematics

COLUMN GENERATION WITH GAMS ERWIN KALVELAGEN Abstract. This document describes an implementation of a Column Generation algorithm using GAMS. The well-known cutting stock problem and a personnel planning problem are used

Source URL: www.amsterdamoptimization.com

• Operations research
• Mathematics
• Mathematical analysis
• Computational complexity theory
• Knapsack problem
• Cutting stock problem
• Dynamic programming
• Pi
• Linear programming
• Mathematical optimization
• Column generation

History dependent public policies David Evans ∗ Thomas J. Sargent‡†

Source URL: www.tomsargent.com

• Computing
• Software
• Computer programming
• Equations
• Mathematical optimization
• Application programming interfaces
• Bellman equation
• Control theory
• Dynamic programming
• Qt
• P22
• Ramsey problem